Optimal and Near-Optimal Online Strategies for Energy Harvesting Broadcast Channels

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal transmission schemes for parallel and fading Gaussian broadcast channels with an energy harvesting rechargeable transmitter

We consider an energy harvesting transmitter sending messages to two users over parallel and fading Gaussian broadcast channels. Energy required for communication arrives (is harvested) at the transmitter and a finite-capacity battery stores it before being consumed for transmission. Under off-line knowledge of energy arrival and channel fading variations, we obtain the trade-off between the pe...

متن کامل

Optimal Offline Broadcast Scheduling with an Energy Harvesting Transmitter

We consider an energy harvesting transmitter broadcasting data to two receivers. Energy and data arrivals are assumed to occur at arbitrary but known instants. The goal is to minimize the total transmission time of the packets arriving within a certain time window, using the energy that becomes available during this time. An achievable rate region with structural properties satisfied by the two...

متن کامل

Multiple Broadcast Channels with Energy Harvesting

In this chapter, we consider the energy-bandwidth allocation for a network with multiple broadcast channels, where the transmitters access the network orthogonally on the assigned frequency band and each transmitter communicates with multiple receivers orthogonally or non-orthogonally. We assume that the energy harvesting state and channel gain of each transmitter can be predicted for K slots a...

متن کامل

Near-Optimal Algorithms for Online Matrix Prediction

In several online prediction problems of recent interest the comparison class is composed of matrices with bounded entries. For example, in the online max-cut problem, the comparison class is matrices which represent cuts of a given graph and in online gambling the comparison class is matrices which represent permutations over n teams. Another important example is online collaborative filtering...

متن کامل

Capacity and Optimal Resource Allocation for Fading Broadcast Channels

We derive the ergodic (Shannon) capacity region of an M-user broadcast fading channel for code-division (CD), time-division (TD) and frequency-division (FD), assuming that both the transmitter and the receivers have perfect channel side information. It is shown that by allowing dynamic resource allocation, TD, FD and CD without successive decoding have the same ergodic capacity region and optim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Journal on Selected Areas in Communications

سال: 2016

ISSN: 0733-8716

DOI: 10.1109/jsac.2016.2611858